Belief decision trees: theoretical foundations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Belief decision trees: theoretical foundations

This paper extends the decision tree technique to an uncertain environment where the uncertainty is represented by belief functions as interpreted in the Transferable Belief Model (TBM). This so-called belief decision tree is a new classification method adapted to uncertain data. We will be concerned with the construction of the belief decision tree from a training set where the knowledge about...

متن کامل

Theoretical Foundations for Belief Revision

Belief revision systems are AI programs that deal with contradictions. They work with a knowledge base, performing reasoning from the propositions in the knowledge base, "filtering" those propositions so that only part of the knowledge base is perceived the set of propositions that are under consideration. This set of propositions is called the set of believed propositions. Typically, belief re...

متن کامل

Classification with Belief Decision Trees

Decision trees are considered as an efficient technique to express classification knowledge and to use it. However, their most standard algorithms do not deal with uncertainty, especially the cognitive one. In this paper, we develop a method to adapt the decision tree technique to the case where the object’s classes are not exactly known, and where the uncertainty about the class’ value is repr...

متن کامل

Decision Trees: More Theoretical Justification

We study impurity-based decision tree algorithms such as CART, C4.5, etc., so as to better understand their theoretical underpinnings. We consider such algorithms on special forms of functions and distributions. We deal with the uniform distribution and functions that can be described as unate functions, linear threshold functions and readonce DNF. For unate functions we show that that maximal ...

متن کامل

Decision trees using the belief function theory

This paper presents an algorithm for building decision trees in an uncertain environment. Our algorithm will use the theory of belief functions in order to represent the uncertainty about the parameters of the classification problem. Our method will be concerned with both the decision tree building task and the classification task.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2001

ISSN: 0888-613X

DOI: 10.1016/s0888-613x(01)00045-7